The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

w(r(x)) → r(w(x))
b(r(x)) → r(b(x))
b(w(x)) → w(b(x))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
w(r(x)) →⁺ r(w(x))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [x / r(x)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)